Sliding subspace design based on linear matrix inequalities
نویسندگان
چکیده
منابع مشابه
A Sliding Surface Design for Linear Systems with Mismatched Uncertainties based on Linear Matrix Inequality
Sliding mode control (SMC) is an effective method of controlling systems with uncertainties which satisfy the socalled matching condition. However, how to effectively handle mismatched uncertainties of systems is still an ongoing research issue in SMC. Several methods have been proposed to design a stable sliding surface even if mismatched uncertainties exist in a system. Especially, it is pres...
متن کاملController Design Using Linear Matrix Inequalities
2.3. H∞ Performance 3. Controller Design Using Linear Matrix Inequalities 3.1. Linearizing Change of Variables – State Feedback 3.2. Linearizing Change of Variables Output Feedback 3.3. LMI Approach to Multiobjective Design 3.4. Existence of Solutions and Conservatism of Design 4. Illustrative Design Example: Robust Control of a Power System Stabilizer 4.1. Problem Description 4.2. Design Speci...
متن کاملLinear optimization on Hamacher-fuzzy relational inequalities
In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...
متن کاملMatrix-Based Kernel Subspace Methods
It is a common practice that a matrix, the de facto image representation, is first converted into a vector before fed into subspace analysis or kernel method; however, the conversion ruins the spatial structure of the pixels that defines the image. In this paper, we propose two kernel subspace methods that are directly based on the matrix representation, namely matrix-based kernel principal com...
متن کاملOn the Low Rank Solutions for Linear Matrix Inequalities
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was shown in AuYeung and Poon [1] and Barvinok [3]. In Au-Yeung and Poon’s approach, an earlier unpublished manuscript of Bohnenblust [6] played an essential role. Both proofs in [1] and [3] are nonconstructive in nature. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2014
ISSN: 0023-5954,1805-949X
DOI: 10.14736/kyb-2014-3-0436